منابع مشابه
Circuit Complexity
Combinational circuits or shortly circuits are a model of the lowest level of computer hardware which is of interest from the point of view of computer science. Circuit complexity has a longer history than complexity theory. Complexity measures like circuit size and depth model sequential time, hardware cost, parallel time, and even storage space. This chapter contains an overview on the resear...
متن کاملQuantum Circuit Complexity
We propose a complexity model of quantum circuits analogous to the standard (acyclic) Boolean circuit model. It is shown that any function computable in polynomial time by a quantum Turing machine has a polynomial-size quantum circuit. This result also enables us to construct a universal quantum computer which can simulate, with a polynomial factor slowdown, a broader class of quantum machines ...
متن کاملPolymorphisms and Circuit Complexity
We present a framework for studying circuit complexity that is inspired by techniques that are used for analyzing the complexity of CSPs. We prove that the circuit complexity of a Boolean function f is characterized by the partial polymorphisms of f ’s truth table. Moreover, the non-deterministic circuit complexity of f is characterized by the polymorphisms of f ’s truth table.
متن کاملCircuit Complexity of Shuffle
We show that Shuffle(x, y, w), the problem of determining whether a string w can be composed from an order preserving shuffle of strings x and y, is not in AC, but it is in AC. The fact that shuffle is not in AC is shown by a reduction of parity to shuffle and invoking the seminal result [FSS84], while the fact that it is in AC is implicit in the results of [Man82a]. Together, the two results p...
متن کاملCs221: Computational Complexity Lecture 20: Circuit Complexity
2 Existential Lower Bounds Theorem 1 (Lupanov, Shannon) For each ε > 0 and for each sufficiently large n, ∃f : {0, 1}n → {0, 1} with circuit complexity (over the full basis B2) at least (1− ε)2n n . Proof: We will prove the required result using a counting argument. In particular, we will show that the number of functions mapping {0, 1}n to {0, 1} is much larger than the number of ’distinct’ ci...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 2020
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.124.101602